Graphs and networks theory

This chapter discusses graphs and networks theory

A notion of graph likelihood and an infinite monkey theorem

We play with a graph-theoretic analogue of the folklore infinite monkey theorem. We define a notion of graph likelihood as the probability that a given graph is constructed by a monkey in a number of time steps equal to the number of vertices. We present an algorithm to compute this graph invariant and closed formulas for some infinite classes. We have to leave the computational complexity of the likelihood as an open problem.Comment: 6 pages, 1 EPS figur

Intra-tumour signalling entropy determines clinical outcome in breast and lung cancer.

The cancer stem cell hypothesis, that a small population of tumour cells are responsible for tumorigenesis and cancer progression, is becoming widely accepted and recent evidence has suggested a prognostic and predictive role for such cells. Intra-tumour heterogeneity, the diversity of the cancer cell population within the tumour of an individual patient, is related to cancer stem cells and is also considered a potential prognostic indicator in oncology. The measurement of cancer stem cell abundance and intra-tumour heterogeneity in a clinically relevant manner however, currently presents a challenge. Here we propose signalling entropy, a measure of signalling pathway promiscuity derived from a sample's genome-wide gene expression profile, as an estimate of the stemness of a tumour sample. By considering over 500 mixtures of diverse cellular expression profiles, we reveal that signalling entropy also associates with intra-tumour heterogeneity. By analysing 3668 breast cancer and 1692 lung adenocarcinoma samples, we further demonstrate that signalling entropy correlates negatively with survival, outperforming leading clinical gene expression based prognostic tools. Signalling entropy is found to be a general prognostic measure, valid in different breast cancer clinical subgroups, as well as within stage I lung adenocarcinoma. We find that its prognostic power is driven by genes involved in cancer stem cells and treatment resistance. In summary, by approximating both stemness and intra-tumour heterogeneity, signalling entropy provides a powerful prognostic measure across different epithelial cancers

Regular quantum graphs

We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way incoming and outgoing channels at vertex scattering processes are connected. Symmetry properties of the quantum graph as well as its spectral statistics depend on the particular choice of permutation matrices, also called connectivity matrices, and can now be easily controlled. The method may find applications in the study of quantum random walks networks and may also prove to be useful in analysing universality in spectral statistics.Comment: 12 pages, 3 figure

Combinatorial Entanglement

We present new combinatorial objects, which we call grid-labelled graphs, and show how these can be used to represent the quantum states arising in a scenario which we refer to as the faulty emitter scenario: we have a machine designed to emit a particular quantum state on demand, but which can make an error and emit a different one. The device is able to produce a list of candidate states which can be used as a kind of debugging information for testing entanglement. By reformulating the Peres-Horodecki and matrix realignment criteria we are able to capture some characteristic features of entanglement: we construct new bound entangled states, and demonstrate the limitations of matrix realignment. We show how the notion of LOCC is related to a generalisation of the graph isomorphism problem. We give a simple proof that asymptotically almost surely, grid-labelled graphs associated to very sparse density matrices are entangled. We develop tools for enumerating grid-labelled graphs that satisfy the Peres-Horodecki criterion up to a fixed number of vertices, and propose various computational problems for these objects, whose complexity remains an open problem. The proposed mathematical framework also suggests new combinatorial and algebraic ways for describing the structure of graphs

Permutation graphs and unique games

We study the value of unique games as a graph-theoretic parameter. This is obtained by labeling edges with permutations. We describe the classical value of a game as well as give a necessary and sufficient condition for the existence of an optimal assignment based on a generalisation of permutation graphs and graph bundles. In considering some special cases, we relate XOR games to EDGE BIPARTIZATION, and define an edge-labeling with permutations from Latin squares

Permutation graphs and unique games

We study the value of unique games as a graph-theoretic parameter. This is obtained by labeling edges with permutations. We describe the classical value of a game as well as give a necessary and sufficient condition for the existence of an optimal assignment based on a generalisation of permutation graphs and graph bundles. In considering some special cases, we relate XOR games to EDGE BIPARTIZATION, and define an edge-labeling with permutations from Latin squares